package leetcode;

/**
 * @Description: TODO
 * @author: XiaoWenzhuo
 * @date: 2022-04-18 14:22
 */
public class Recursion {
    public static int fib(int n){
        if(n==0||n==1){
            return n;
        }
        return fib(n-1)+fib(n-2);
    }

    public static void main(String[] args) {
        int fib = fib(8);
        System.out.println(fib);
    }
}
